A Parallel Manipulation Method for Zero-suppressed Binary Decision Diagram
نویسندگان
چکیده
A parallel algorithm for the manipulation of Zero-suppressed Binary Decision Diagrams (ZBDDs) on a shared memory multi-processor system was described. Theoretical analysis showed that parallel manipulation of ZBDD has a better time performance than the sequential operation of ZBDD. Since the parallel ZBDD algorithm uses much less time than the ordinary ZBDD algorithm, a real-time calculation can be done in the risk monitoring of a nuclear power plant, which would do a favor of accelerating emergency response and improving safety of nuclear power plants.
منابع مشابه
Time and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملA Compact and Fast Index Structure for Families of Sets
In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set families is one of the important fundamental techniques for web information retrieval, integration, and mining. For this purpose, a special type of binary decision diagrams (BDDs), called Zero-suppressed BDDs (ZDDs), is used. However, current techniques for storing ZDDs require a h...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملA New Symbolic Method for Discernibility Matrix in Rough Set
Generating discernibility matrix consumes huge time and space .To solve this problem, A new Binary Discernibility Matrix (BDM) induced from information table is defined, The concept of Binary Conjunction Matrix(BCM) is then introduced, Finally A novel method for discernibility matrix using Zero-Suppressed BDDs (ZBDD) and Ordered binary decision diagrams (OBDD) is proposed in this paper, experim...
متن کامل